Conway's Question: The Chase for Completeness

نویسندگان

  • Dikran Dikranjan
  • Elena Martín Peinador
  • Vaja Tarieladze
چکیده

We study various degrees of completeness for a Tychonoff space X. One of them plays a central role, namely X is called a Conway space if X is sequentially closed in its Stone–Čech compactification βX (a prominent example of Conway spaces is provided by Dieudonné complete spaces). The Conway spaces constitute a bireflective subcategory Conw of the category Tych of Tychonoff spaces. Replacing sequential closure by the general notion of a closure operator C, we introduce analogously the subcategory ConwC of C-Conway spaces, that turns out to be again a bireflective subcategory of Tych. We show that every bireflective subcategory of Tych can be presented in this way by building a Galois connection between bireflective subcategories of Tych and closure operators of Top finer than the Kuratowski closure. Other levels of completeness are considered for the (underlying topological spaces of) topological groups. A topological group G is sequentially complete if it is sequentially closed in its Raı̆kov completion G̃. The sequential completeness for The paper was written while the author was visiting the Department of Topology and Geometry of Complutense University of Madrid and was supported by a grant of Grupo Santander (in the program Estancias de Doctores y Tecnólogos Extranjeros en la U.CM.). He takes the opportunity to thank his hosts for the warm hospitality and generous support. The second and the third author acknowledge the financial aid received from MCYT, BFM2003-05878 and FEDER funds. D. Dikranjan (B) Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100 Udine, Italy e-mail: [email protected] E. Martín Peinador Departamento de Geometría y Topología, Universidad Complutense de Madrid, Madrid, Spain e-mail: [email protected] V. Tarieladze N. Muskhelishvili Institute of Computational Mathematics, Georgian Academy of Sciences, Akuri Str. 8, Tbilisi-0193, Georgia e-mail: [email protected] D. Dikranjan, et al. topological groups is stronger than Conway’s property, although they coincide in some classes of topological groups, for example: free (Abelian) topological groups, pseudocompact groups, etc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Completeness results for metrized rings and lattices

The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (for example, ${0})$ that are closed under the natural metric, but has no prime ideal closed under that metric; hence closed radical ideals are not, in general, intersections of closed prime ideals. Moreover, $B$ is known to be complete in its metric. Togethe...

متن کامل

Philosophy and The Human Inheritance in a Post-Western World

The dissolution of the Western-dominated Postwar Order, and the Eurocentric myths that sustain it, presents a unique opportunity to ponder an old question posed by every new generation: How can philosophy, which Islamic and ancient Greek learning traditions have long defined as the pursuit of “wisdom,” resume its millennial civilizing role? This paper looks beyond passing political events to re...

متن کامل

DASTWAR: a tool for completeness estimation in magnitude-size plane

Today, great observatories around the world, devote a substantial amount of observing time to sky surveys. The resulted images are inputs of source finder modules. These modules search for the target objects and provide us with source catalogues. We sought to quantify the ability of detection tools in recovering faint galaxies regularly encountered in deep surveys. Our approach was based on com...

متن کامل

A New Approach to Inferences of Semantic Constraints

Chase procedures are well-known decision and semi-decision procedures for the implication problem among dependencies, a specific type of first-order logic formulas, that are used for expressing database constraints. Of course, the implication problem can also be treated by general refutationally complete inference systems, like resolution with paramodulation. Recently the inference rule of basi...

متن کامل

Beyond Skolem Chase: A Study of Finite Chase under Standard Chase Variant

The chase procedure is an indispensable tool for several database applications, where its termination guarantees decidability of these tasks. Most previous studies have focused on the skolem chase variant and its termination. It is known that the standard chase variant is more powerful in termination analysis provided a database is given. But all-instance termination analysis presents a challen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Categorical Structures

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2007